Haar Local Binary Pattern Feature for Fast Illumination Invariant Face Detection

نویسندگان

  • Anindya Roy
  • Sébastien Marcel
چکیده

Face detection systems based on boosted Haar features in a cascade architecture [3] perform very well both in terms of accuracy and speed. However, they are vulnerable to variations in illumination conditions. On the other hand, face detection systems based on the Local Binary Pattern (LBP) [2] or its variants [1] show robustness to illumination conditions but do not take advantage of the richness of the Haar feature set in efficiently modelling faces. In this paper, we propose a face detection system based on a new type of feature called the Haar Local Binary Pattern (HLBP) feature which combines the advantages of both Haar and LBP and is boosted using AdaBoost as in [3]. This feature compares the LBP label counts in two adjacent image subregions similar to Haar masks, i.e. it indicates whether the number of times a particular LBP label occurs in one region is greater or lesser than the number of times it occurs in another region, offset by a certain threshold. They capture the region-specific variations of local texture patterns which is hypothesized to remain relatively stable across variations in illumination conditions. Experiments show that our features more robust to illumination variations, compared to Haar and LBP individually. Let the input be an N×M gray-level image, represented as an N×M matrix I. Firstly, the LBP image ILBP [2] is calculated from the original input image I using LBP4,1, (ref. Fig. 1) found to be the optimal operator in our case. Next, the Integral Histogram set {IH k } 16 k=1 [4] of the LBP image ILBP is calculated. The individual pixels IH k (x,y) of the k-th Integral Histogram IH k is calculated as the number of pixels above and to the left of the pixel (x,y) in the LBP image ILBP which have a label k, i.e. IH k (x,y) = ∑u≤x,v≤y δk(u,v), where δk(u,v) = 1 if the label of the pixel at location (u,v) in the LBP image ILBP is k, and is zero otherwise. Using the following pair of references, for all k ∈ {1,16} :

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ROY, MARCEL: HLBP FEATURE FOR FAST ILLUMINATION INVARIANT FACE DETECTION1 Haar Local Binary Pattern Feature for Fast Illumination Invariant Face Detection

Face detection is the first step in many visual processing systems like face recognition, emotion recognition and lip reading. In this paper, we propose a novel feature called Haar Local Binary Pattern (HLBP) feature for fast and reliable face detection, particularly in adverse imaging conditions. This binary feature compares bin values of Local Binary Pattern histograms calculated over two adj...

متن کامل

Face Detection Algorithm Based on Haar and Local Binary Pattern Features

Face detection is one of the hottest research topics of the field of pattern recognition, image processing, machine vision, and etc. This paper proposes a novel method for fast and reliable face detection, especially in complex background. Firstly, the Haar features of the training image are extracted, and then the training image is divided into small blocks to extract local binary pattern (LBP...

متن کامل

Face Detection Based on Multi-Block LBP Representation

Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this paper, we present the use of a new set of distinctive rectangle features, called Multi-block Local Binary Patterns (MB-LBP), for face detection. The MB-LBP encodes rectangular regions’ intensities by local binary patte...

متن کامل

Multi-scale logarithmic difference face recognition based on local binary pattern

In order to solve the problem that face recognition is sensitive to illumination variation and local binary pattern has small spatial support region. A novel face recognition approach which is multi-scale logarithmic difference face recognition based on local binary pattern is proposed. Firstly, LBP operator is used to extract the texture feature of the face. Secondly, the LBP feature is used t...

متن کامل

Local Binary Haar Feathers Kadane and Multi-Threshold AdaBoost for Facial Classification and Recognition

A face recognition algorithm based on local binary Haar feathers which represented as Kadane optimizing multi-threshold AdaBoost was proposed according to the problems of texture shape feature representation and classification algorithm accuracy in the process of facial classifying detection and recognition, First, improve the traditional expression by using image Local binary pattern of Haar f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009